منابع مشابه
A New Material Harder Than Diamond ? Carbon ( iv )
The prediction of the existence and the structure of previously unknown solid-state compounds seems to be par ticularly difficult, because numerous complex, interacting factors must be taken into account. A simplification to a certain extent is possible with predominantly covalent poly meric solid-state compounds in which coordination numbers and geometries are unambiguously stipulated for th...
متن کاملIs carbon nitride harder than diamond? No, but its girth increases when stretched(negative Poisson ratio)
It has been believed that C3N 4 ceramic would be harder than diamond. Predictions are reported of the mechanical properties based on a force field derived from ab initio quantum mechanics. The predicted structure for oc-C3N 4 is in good agreement with transmission electron diffraction (TED) studies, supporting the identity of the films as ot-C3N 4. The bulk modulus of ot-C3N 4 is calculated to ...
متن کاملN Semantic Classes are Harder than Two
We show that we can automatically classify semantically related phrases into 10 classes. Classification robustness is improved by training with multiple sources of evidence, including within-document cooccurrence, HTML markup, syntactic relationships in sentences, substitutability in query logs, and string similarity. Our work provides a benchmark for automatic n-way classification into WordNet...
متن کاملIs Belief Revision Harder Than You Thought?
Suppose one wishes to construct, use, and maintain a knowledge base (KB) of beliefs about the real world, even though the facts about that world are only partially known. In the AI domain, this problem arises when an agent has a base set of beliefs that reflect partial knowledge about the world, and then tries to incorporate new, possibly contradictory knowledge into this set of beliefs. We cho...
متن کاملRecognition can Be Harder Than Parsing
The work presented here attempts to bring out some fundamental concepts that underlie some known parsing algorithms, usually called chart or dynamic programming parsers, in the hope of guiding the design of similar algorithms for other formalisms that could be considered for describing the “surface” syntax of languages. The key idea is that chart parsing is essentially equivalent to a simple co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1996
ISSN: 0028-0836,1476-4687
DOI: 10.1038/380104a0